Efficient blind search: Optimal power of detection under computational cost constraints
نویسندگان
چکیده
منابع مشابه
Efficient Blind Search: Optimal Power of Detection under Computational Cost Constraints by Nicolai Meinshausen,
Some astronomy projects require a blind search through a vast number of hypotheses to detect objects of interest. The number of hypotheses to test can be in the billions. A naive blind search over every single hypothesis would be far too costly computationally. We propose a hierarchical scheme for blind search, using various “resolution” levels. At lower resolution levels, “regions” of interest...
متن کاملEfficient blind search: Optimal power of detection under computational cost constraints
Some astronomy projects require a blind search through a vast number of hypotheses to detect objects of interest. The number of hypotheses to test can be in the billions. A naive blind search over every single hypothesis would be far too costly computationally. We propose a hierarchical scheme for blind search, using various ‘resolution’ levels. At lower resolution levels, ‘regions’ of interest...
متن کاملEfficient Optimal Search under Expensive Edge Cost Computation
Optimal heuristic search has been successful in many domains where the cost of each action can easily be obtained. However, in many problems, the exact edge cost is expensive to compute. Existing search algorithms face a significant performance bottleneck, due to an excessive overhead associated with dynamically calculating exact edge costs. We present DEA*, an algorithm for problems with expen...
متن کاملEfficient Optimal Search of Euclidean-Cost Grids and Lattices
We describe a simple technique to speed up optimal path planning on Euclidean-cost grids and lattices. Many robot navigation planning algorithms build approximate grid representations of the environment and use Djikstra’s algorithm or A* to search the resulting embedded graph for an optimal path between given start and goal locations. However, the classical implementations of these search algor...
متن کاملAdaptive Sampling: Efficient Search Schemes under Resource Constraints
The field of adaptive sampling has generated a lot of excitement in the signal processing community. It was shown that a certain class of inhomogeneous signals can be reconstructed with far fewer samples than required by traditional sampling methods. However, this class does not cover interesting signals for which adaptive sampling methods can be used. Applications such as target monitoring inv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Statistics
سال: 2009
ISSN: 1932-6157
DOI: 10.1214/08-aoas180